Achieving Optimality for Gate Matrix Layout and PLA Folding: a Graph Theoretic Approach
نویسندگان
چکیده
منابع مشابه
Layout Generation of Array Cell for NMOS 4-phase Dynamic Logic
| An array cell (AC) architecture for the layout design is described, which is dedicated to lowpower design by means of the NMOS 4-phase dynamic logic. An AC is constructed of (M N)+2 transistors so as to constitute each type of NMOS 4-phase logic gates. A graph theoretic approach is exploited in the layout design to reduce the layout area. A number of experimental results demonstrate the pract...
متن کاملDefragmenting the Module Layout of a Partially Reconfigurable Device
Modern generations of field-programmable gate arrays (FPGAs) allow for partial reconfiguration. In an online context, where the sequence of modules to be loaded on the FPGA is unknown beforehand, repeated insertion and deletion of modules leads to progressive fragmentation of the available space, making defragmentation an important issue. We address this problem by propose an online and an offl...
متن کاملAn efficient algorithm for bipartite PLA folding
Programmable Logic Arrays (PLA’s) provide a flexible and efficient way of synthesizing arbitrary combinational functions as well as sequential logic circuits. They are used in both LSI and VLSI technologies. The disadvantage of using PLA’s is that most PLA’s are very sparse. The high sparsity of the PLA results in a significant waste of silicon area. PLA folding is a technique which reclaims un...
متن کاملGraph Theoretic Analysis of PLA Folding Heuristics
Because the problem of folding a programmable logic array (PLA) to its smallest possible area is NP-complete, the design and analysis of PLA-folding heuristics is important. In this paper, we study PLA-folding heuristics from a theoretical perspective, using the folding ratio of the heuristic to characterize its worst case behavior. In the first portion of this paper, we obtain best possible bo...
متن کاملA module theoretic approach to zero-divisor graph with respect to (first) dual
Let $M$ be an $R$-module and $0 neq fin M^*={rm Hom}(M,R)$. We associate an undirected graph $gf$ to $M$ in which non-zero elements $x$ and $y$ of $M$ are adjacent provided that $xf(y)=0$ or $yf(x)=0$. Weobserve that over a commutative ring $R$, $gf$ is connected anddiam$(gf)leq 3$. Moreover, if $Gamma (M)$ contains a cycle,then $mbox{gr}(gf)leq 4$. Furthermore if $|gf|geq 1$, then$gf$ is finit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Integration
دوره 14 شماره
صفحات -
تاریخ انتشار 1992